To solve the multi-label classification problem that a target belongs to multiple classes, a new multi-label classification algorithm based on floating threshold classifiers combination was proposed. Firstly, the theory and error estimation of the AdaBoost algorithm with floating threshold (AdaBoost.FT) were analyzed and discussed, and it was proved that AdaBoost.FT algorithm could overcome the defect of unstabitily when the fixed segmentation threshold classifier was used to classify the points near classifying boundary, the classification accuracy of single-label classification algorithm was improved. And then, the Binary Relevance (BR) method was introduced to apply AdaBoost.FT algorithm into multi-label classification problem, and the multi-label classification algorithm based on floating threshold classifiers combination was presented, namely multi-label AdaBoost.FT. The experimental results show that the average precision of multi-label AdaBoost. FT outperforms the other three multi-label algorithms, AdaBoost.MH (multiclass, multi-label version of AdaBoost based on Hamming loss), ML-kNN (Multi-Label k-Nearest Neighbor), RankSVM (Ranking Support Vector Machine) about 4%, 8%, 11% respectively in Emotions dataset, and is just little worse than RankSVM about 3%, 1% respectively in Scene and Yeast datasets. The experimental analyses show that multi-label AdaBoost. FT can obtain the better classification results in the datasets which have small number of labels or whose different labels are irrelevant.